Complexity Reduction of Catmull-Clark/Loop Subdivision Surfaces
نویسندگان
چکیده
By applying a filter this algorithm can reduce the number of polygons generated by subdividing a mesh dynamically. This algorithm is designed especially for real-time engines where the geometrical complexity is critical. It also avoids edge cracks and is generally more efficient than a general-purpose polygon reduction algorithm.
منابع مشابه
Evaluation of Loop Subdivision Surfaces
This paper describes a technique to evaluate Loop subdivision surfaces at arbitrary parameter values. The method is a straightforward extension of our evaluation work for Catmull-Clark surfaces. The same ideas are applied here, with the differences being in the details only.
متن کاملExact Evaluation of Catmull-Clark Subdivision Surfaces Near B-Spline Boundaries
In a seminal paper [5], Jos Stam gave a method for evaluating Catmull-Clark subdivision surfaces [1] at parameter values near an interior extraordinary vertex (EV). The basic idea is to subdivide recursively until the (u, v) parameter to be evaluated is contained in a regular 4×4 grid of control points which define a bicubic B-spline patch. The subdivision steps can be computed very efficiently...
متن کاملTSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces
We present a novel, compact bounding volume hierarchy, TSS BVH, for ray tracing subdivision surfaces computed by the Catmull-Clark scheme. We use Tetrahedron Swept Sphere (TSS) as a bounding volume to tightly bound limit surfaces of such subdivision surfaces given a user tolerance. Geometric coordinates defining our TSS bounding volumes are implicitly computed from the subdivided mesh via a sim...
متن کاملHardware Subdivision and Tessellation of Catmull-Clark Surfaces
We present a table driven approach to performing Catmull-Clark subdivision in parallel utilizing one thread per output mesh vertex. We apply the procedure one or two times in order to isolate extraordinary vertices and simplify the input patch structures consumed by the hardware unit responsible for adaptive tessellation. From this simplified mesh, we evaluate the performance Stam’s direct eval...
متن کاملEfficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces
We present a novel method to evaluate semi-smooth creases in Catmull-Clark subdivision surfaces. Our algorithm supports both integer and fractional crease tags corresponding to the RenderMan (Pixar) specification. In order to perform fast and efficient surface evaluations, we obtain a polynomial surface representation given by the semismooth subdivision rules. While direct surface evaluation is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001